A parallel tabu search algorithm for large traveling salesman problems
نویسندگان
چکیده
منابع مشابه
A General Parallel Tabu Search Algorithm For Combinatorial Optimisation Problems ?
Tabu Search (TS) is a meta-heuristic search algorithm that is easy to parallelise. E cient parallelisation of TS can represent a signi cant saving in the real-time required to solve a problem over an equivalent sequential algorithm. In this study, a general parallel TS algorithm for solving combinatorial optimisation problems (COPs) is presented. The unique feature of our approach is that the T...
متن کاملA Tabu Search Algorithm for the Symmetric Generalized Traveling Salesman Problem
The Generalized Traveling Salesman Problem (GTSP) consists of finding a least cost Hamiltonian circuit or cycle through several clusters of vertices. In this paper we propose a new tabu search algorithm which uses the problem’s configuration to guide the search and reduce the solution space. A new way to manage the tabu restrictions, specially adapted to this problem, is also proposed. Results ...
متن کاملParallel Adaptive Tabu Search for Large Optimization Problems
This paper presents a new approach for parallel tabu search based on adaptive par-allelism. Adaptive parallelism demonstrates that massively parallel computing using a hundred of heterogeneous machines is feasible to solve large optimization problems. The parallel tabu search algorithm includes diierent tabu list sizes and new intensiication/diversiication mechanisms. Encouraging results have b...
متن کاملA Review of the Tabu Search Literature on Traveling Salesman Problems
The Traveling Salesman Problem (TSP) is one of the most widely studied problems in combinatorial optimization. It has long been known to be NP-hard and hence research on developing algorithms for the TSP has focused on approximate methods in addition to exact methods. Tabu search is one of the most widely applied metaheuristic for solving the TSP. In this paper, we review the tabu search litera...
متن کاملTabu Search on the Geometric Traveling Salesman Problem
I Abstract The Traveling Salesman Problem (TSP) is probably the most well-known problem of its genre: Combinatorial Optimization. New heuristics, built on the concept of local search, i.e. continuously to make transitions from one solution to another in the search for better solutions have shown to be successful, especially for medium-to large-scale problems (+1000 cities). This thesis presents...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)00033-i